We introduce the logic of Here-and-There with Constraints in order to capture constraint theories in the non-monotonic setting known from Answer Set Programming (ASP). This allows for assigning default values to constraint variables or to leave them undefined. Also, it provides us with a semantic framework integrating ASP and Constraint Processing in a uniform way. We put some emphasis on logic...

Assignment Exchanges Paul Milgrom September 6, 2008 Abstract. We analyze assignment exchanges –auction and exchange mechanisms which are tight simplifications of direct Walrasian exchange mechanisms. These simplifications are distinguished by their use of “assignment messages,” which parameterize certain substitutable preferences. The “basic” assignment exchanges respect integer constraints, ge...

Claude Bernard, Tom Burch, Thomas A. DeGrand, Carleton DeTar, Steven Gottlieb, Urs M. Heller , James E. Hetrick, Kostas Orginos, Bob Sugar and Doug Toussaint Department of Physics, Washington University, St. Louis, MO 63130, USA, Department of Physics, University of Arizona, Tucson, AZ 85721, USA, Physics Department, University of Colorado, Boulder, CO 80309, USA Physics Department, University ...

In this paper, we introduce two pairs of rough operations on Boolean algebras. First we define a pair of rough approximations based on a partition of the unity of a Boolean algebra. We then propose a pair of generalized rough approximations on Boolean algebras after defining a basic assignment function between two different Boolean algebras. Finally, some discussions on the relationship between...

Evolutionary Algorithms (EAs) are stochastic optimization algorithms which have already shown their efficiency on many application domains. This is achieved mainly due to the many parameters that can be defined by the user according to the problem at hand. However, the performance of EAs is very sensitive to the setting of these parameters, and there are no general guidelines for an efficient s...

Credit Assignment is an important ingredient of several proposals that have been made for Adaptive Operator Selection. Instead of the average fitness improvement of newborn offspring, this paper proposes to use some empirical order statistics of those improvements, arguing that rare but highly beneficial jumps matter as much or more than frequent but small improvements. An extreme value based C...

FuncTion is a static analyzer designed for proving conditional termination of C programs by means of abstract interpretation. Its underlying abstract domain is based on piecewise-defined functions, which provide an upper bound on the number of program execution steps until termination as a function of the program variables. In this paper, we fully parameterize various aspects of the abstract do...